/*
 * This project provides a number of implementations for indexing and evaluating
 * <i>Continuous Top-k Queries over Text Streams</i>
 * and has been developped as part of the work described in the article:
 * 
 * Vouzoukidou, N., Amann, B., & Christophides, V. (2012, October). 
 * Processing continuous text queries featuring non-homogeneous scoring functions.
 * In Proceedings of the 21st ACM international conference on Information and 
 * knowledge management (pp. 1065-1074). ACM.
 * http://dl.acm.org/citation.cfm?id=2398404
 * 
 * This software is distributed under the GNU General Public License and as an
 * additional condition of usage, please cite the aforementioned article.
 * 
 * Copyright (C) 2012 ICS/FORTH, Greece and 
 *               2012 LIP6, France
 * 
 * Author: Vouzoukidou Nelly, email: nelly.vouzoukidou (at) gmail (dot) com
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */
package gr.forth.ics.continuoustopk.datasets;

import gr.forth.ics.continuoustopk.metrics.TimestampsStrategy;
import java.io.File;

/**
 *
 * @author Vouzoukidou Nelly, email: nelly.vouzoukidou (at) gmail (dot) com
 */
public class DatasetConstants {

    // files
    public static final String datasetsFolder = "datasets/";
    public static final File itemsFile = new File(datasetsFolder + "itemsTfIdf15000.txt");
    public static final File queriesFile = new File(datasetsFolder + "queriesTfIdf.txt");
    public static final File[] queriesWithLength = new File[] {
        new File(datasetsFolder + "queriesLength0.txt"),
        new File(datasetsFolder + "queriesLength1.txt"),
        new File(datasetsFolder + "queriesLength2.txt"),
        new File(datasetsFolder + "queriesLength3.txt"),
        new File(datasetsFolder + "queriesLength4.txt")
    };
    
    // random queries generator constants
    public static final int vocabularySize = 100;
    public static final int maxItemSize = 20;
    public static TimestampsStrategy timestampsStrategy = TimestampsStrategy.sequencial;

    // constants not to be changed during the experiments
    public static final int warmUp = 3000;
    public static int minQuerySize = 2;

    public static int itemCount = 10000 + warmUp;
    public static int queryCount = 100000;

}
